Definedness and Strictness in Generator Inductive Definitions

نویسنده

  • Olav Lysne
چکیده

We consider a generalized form of inductive definitions as first suggested by Guttag. Partial functions may be defined by introducing error values in the right hand sides. For such definitions the intuitive semantics is not consistent with that of unrestricted rewriting. In general, the addition of rewrite rules capturing the intuitively motivated error propagation will destroy confluence of the rewrite system. We show how to mechanically modify the rewrite system in order to obtain a confluent system consistent with the intuitive semantics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structured general corecursion and coinductive graphs [extended abstract]

Bove and Capretta’s popular method for justifying function definitions by general recursive equations is based on the observation that any structured general recursion equation defines an inductive subset of the intended domain (the “domain of definedness”) for which the equation has a unique solution. To accept the definition, it is hence enough to prove that this subset contains the whole int...

متن کامل

Structured general corecursion and coinductive graphs [ extended

Bove and Capretta’s popular method for justifying function definitions by general recursive equations is based on the observation that any structured general recursion equation defines an inductive subset of the intended domain (the “domain of definedness”) for which the equation has a unique solution. To accept the definition, it is hence enough to prove that this subset contains the whole int...

متن کامل

The Role of Corporate Governance Mechanisms and the Auditor's Specialty in Debt Contract Strictness

Objective: Violation of contractual conditions leads to the transmission of bad news due to poor performance and the expertise of auditors and regulatory mechanisms can be a factor in adjusting it. In this article, the purpose is to examine the role of strictness in the debt contract and the auditor's expertise. Research Method: In order to study the subject based on the logistic regression mo...

متن کامل

Recursive Models of General Inductive Types

We give an interpretation of Martin-Löf’s type theory (with universes) extended with generalized inductive types. The model is an extension of the recursive model given by Beeson. By restricting our attention to PER model, we show that the strictness of positivity condition in the definition of generalized inductive types can be dropped. It therefore gives an interpretation of general inductive...

متن کامل

Transformation in a Non-Strict Language: An Approach to Instantiation

A problem arises when the usual rules of fold/unfold transformation are applied in a non–strict programming system. Case analysis by instantiation may alter strictness characteristics of the function being transformed, and hence alter the behaviour of programs. Although such behavioural changes can in general be quite subtle, they are all too apparent if the program is interactive, since I/O in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002